Weak Assertion

Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks

We present a completeness proof of the inductive assertion method for object-oriented programs extended with auxiliary variables. The class of programs considered are assumed to compute over structures which include the standard interpretation of Presburger arithmetic. Further, the assertion language is first-order, i.e., quantification only ranges over basic types like that of the natural numb...

Understanding Assertion

Native SystemC Assertion mechanism with transaction and temporal assertion support

SystemC [1] is rapidly becoming the language of choice for ESL-centric design methodologies. It is set to become the framework for higherlevel flows above today’s RTL, and has three key components: modeling, synthesis and verification. High-level modeling particularly demonstrates the language’s versatility and advantages. Strong progress is also being made in higher-level synthesis. However, o...

From Assertion-Based Verification to Assertion-Based Synthesis

We propose a linear complexity approach to achieve automatic synthesis of designs from temporal specifications. It uses concepts from the AssertionBased Verification. Each property is turned into a component combining classical monitor and generator features: the extended-generator. We connect them with specific components to obtain a design that is correct by construction. It shortens the desi...

‘‘Assertion’’ and intentionality

Robert Stalnaker argues that his causal-pragmatic account of the problem of intentionality commits him to a coarse-grained conception of the contents of mental states, where propositions are represented as sets of possible worlds. Stalnaker also accepts the ‘‘direct reference’’ theory of names, according to which co-referring names have the same content. Stalnaker’s view of content is thus thre...